Model Checking the Pastry Routing Protocol
نویسندگان
چکیده
Pastry is an algorithm for implementing a scalable distributed hash table over an underlying P2P network, an active area of research in distributed systems. Several implementations of Pastry are available and have been applied in practice, but no attempt has so far been made to formally describe the algorithm or to verify its properties. Since Pastry combines rather complex data structures, asynchronous communication, concurrency, resilience to churn and fault tolerance, it makes an interesting target for verification. We have modeled Pastry’s core routing algorithms in the specification language TLA+ and used its model checker TLC to analyze qualitative properties of Pastry such as correctness and consistency.
منابع مشابه
Towards Verification of the Pastry Protocol Using TLA +
Pastry is an algorithm that provides a scalable distributed hash table over an underlying P2P network. Several implementations of Pastry are available and have been applied in practice, but no attempt has so far been made to formally describe the algorithm or to verify its properties. Since Pastry combines rather complex data structures, asynchronous communication, concurrency, resilience to ch...
متن کاملSCRIBE: The Design of a Large-Scale Event Notification Infrastructure
In this paper we outline the design of Scribe, a reliable large-scale event notification infrastructure, built on top of a peer-to-peer object location and routing infrastructure overlayed on the Internet (Pastry). Scribe provides large-scale distributed applications with a highly flexible group communication protocol. Scribe leverages Pastry [1] and benefits from its robustness, reliability, s...
متن کاملA Testbed-based Analysis of the Incorrect Lookup Routing Attack on the Pastry DHT
Distributed Hashtables (DHT), with Pastry [2] as a prominent representative, are one of the most recent peer-to-peer (P2P) architectures. DHTs scale well to the network size due to a small routing table and a hierarchical routing scheme. In Pastry, the number of routing entries scales logarithmically with respect to the number of participating nodes, because each node maintains route entries to...
متن کاملMADPastry: A DHT Substrate for Practicably Sized MANETs
Because of the increasing interest in mobile ad hoc networks (MANETs) and their inherent similarities to peer-to-peer networks a large number of routing protocols based on peer-to-peer networks have recently been presented to provide distributed network applications with e cient and indirect routing for MANETs. Thomas Zahn and Jochen Schiller suggested MADPastry, an integration of a DHT substra...
متن کاملOptimizing Routing in Structured Peer-to-Peer Overlay Networks Using Routing Table Redundancy
Structured peer-to-peer (p2p) overlay networks like CAN, Chord, Pastry and Tapestry [3, 6, 5, 9] provide a self-organizing substrate for large-scale peer-to-peer applications. These systems provide efficient, fault-tolerant routing, object location and load balancing within a selforganization overlay network. In this paper, we show how redundant information that is collected as part of the norm...
متن کامل